A simplified method for the bilinear s-z transformation
نویسندگان
چکیده
منابع مشابه
A Simplified Method for the Bilinear s-z Transformation
A new technique for performing the bilinear transformation of polynomials is presented. The technique is both simple to understand as well as efficient in its computer implementation. The key to the method is the way in which the successive derivatives of a particular polynomial are computed. A simple recursion formula is used which can be done either by hand, if desired, or by computer. The or...
متن کاملA Simplified Curved Boundary Condition in Stationary/Moving Boundaries for the Lattice Boltzmann Method
Lattice Boltzmann method is one of computational fluid dynamic subdivisions. Despite complicated mathematics involved in its background, end simple relations dominate on it; so in comparison to the conventional computational fluid dynamic methods, simpler computer programs are needed. Due to its characteristics for parallel programming, this method is considered efficient for the simulation of ...
متن کاملA new method for ranking of Z-numbers
In this paper we propose a new method for ranking Z- numbers and generalizations. This method is based on the internal structure of the artificial neural network, which suggests that the structure of this network consists of inputs weights and the transfer function linear, nonlinear and sometimes linear and nonlinear. It is shown that the proposed method while possessing the ranking properties ...
متن کاملA Simplified and Reproducible Two-Step Method for the Purification of Prostate-Specific Antigen
Prostate-specific antigen (PSA) was purified to homogeneity from human seminal plasma by ion-exchange chromatography on a CM-Sephadex C-50 and by gel filtration on a Sephacryl S-200 column. A single 33-kDa protein band appeared in SDS-PAGE. High pressure liquid chromatography (HPLC) of the purified protein produced a single peak, while isoelectric focusing demonstrated the presence of five diff...
متن کاملTransformation Rules for Z
Z is a formal specification language combining typed set theory, predicate calculus, and a schema calculus. This paper describes an extension of Z that allows transformation and reasoning rules to be written in a Z-like notation. This gives a high-level, declarative, way of specifying transformations of Z terms, which makes it easier to build new Z manipulation tools. We describe the syntax and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Education
سال: 1994
ISSN: 0018-9359
DOI: 10.1109/13.312140